Robot Path Planning in 3D Space Using Binary Integer Programming
نویسندگان
چکیده
This paper presents a novel algorithm for path planning of mobile robots in known 3D environments using Binary Integer Programming (BIP). In this approach the problem of path planning is formulated as a BIP with variables taken from 3D Delaunay Triangulation of the Free Configuration Space and solved to obtain an optimal channel made of connected tetrahedrons. The 3D channel is then partitioned into convex fragments which are used to build safe and short paths within from Start to Goal. The algorithm is simple, complete, does not suffer from local minima, and is applicable to different workspaces with convex and concave polyhedral obstacles. The noticeable feature of this algorithm is that it is simply extendable to n-D Configuration spaces. Keywords—3D C-space, Binary Integer Programming (BIP), Delaunay Tessellation, Robot Motion Planning.
منابع مشابه
Designing Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملRobust Path Planning for Mobile Robot Based on Fractional Attractive Force in 3-Dimension Space
In path planning, potential fields introduce force constraints to ensure curvature continuity of trajectories and thus to facilitate path-tracking design. In previous works, a path planning design by fractional (or non integer or generalized) repulsive potential has been developed to avoid fixed obstacles: danger level of each obstacle was characterized by the fractional order of differentiatio...
متن کاملPath Planning Through Variational Dynamic Programming
The path planning problem, i.e., the geometrical problem of finding a collision-free path between two given configurations of a robot moving among obstacles, has been studied by many authors in recent years. Several complete algorithms exist for robots with few degrees of freedom (DOF), but they are intractable for more than 4 DOF. In order to tackle problems in higher dimensions, several heuri...
متن کامل